Parametricity and Variants of Girard's J Operator
نویسندگان
چکیده
The Girard-Reynolds polymorphic -calculus is generally regarded as a calculus of parametric polymorphism in which all well-formed terms are strongly normalizing with respect to -reductions. Girard demonstrated that the additional of a simple "non-parametric" operation, J , to the calculus allows the de nition of a non-normalizing term. Since the type of J is not inhabited by any closed term, one might suspect that this may play a role in de ning a non-normalizing term using it. We demonstrate that this is not the case by giving a simple variant, J , of J whose type is otherwise inhabited and which causes normalization to fail. It appears that impredicativity is essential to the argument; predicative variants of the polymorphic -calculus admit non-parametric operations without sacri cing normalization.
منابع مشابه
Outline of a proof theory of parametricityHarry
Reynolds' Parametricity Theorem (also known as the Abstraction Theorem), a result concerning the model theory of the second order polymorphic typed-calculus (F 2), has recently been used by Wadler to prove some unusual and interesting properties of programs. We present a purely syntactic version of the Parametricity Theorem, showing that it is simply an example of formal theorem proving in seco...
متن کاملExtended and infinite ordered weighted averaging and sum operators with numerical examples
This study discusses some variants of Ordered WeightedAveraging (OWA) operators and related information aggregation methods. Indetail, we define the Extended Ordered Weighted Sum (EOWS) operator and theExtended Ordered Weighted Averaging (EOWA) operator, which are applied inscientometrics evaluation where the preference is over finitely manyrepresentative works. As...
متن کاملParametric and Type-Dependent Polymorphism
In typed languages one can formally describe functions at any finite type, namely functions that take, as input, functions, functionals and so on. In general, higher types are obtained by type constructors, such as "→", "×" or "+". Higher order systems allow quantification over type variables, thus a higher order language must include variables both for individuals and types. The use of type va...
متن کاملOperator Valued Series and Vector Valued Multiplier Spaces
Let $X,Y$ be normed spaces with $L(X,Y)$ the space of continuous linear operators from $X$ into $Y$. If ${T_{j}}$ is a sequence in $L(X,Y)$, the (bounded) multiplier space for the series $sum T_{j}$ is defined to be [ M^{infty}(sum T_{j})={{x_{j}}in l^{infty}(X):sum_{j=1}^{infty}% T_{j}x_{j}text{ }converges} ] and the summing operator $S:M^{infty}(sum T_{j})rightarrow Y$ associat...
متن کاملA Model for Formal Parametric Polymorphism: A PER Interpretation for System R
System R is an extension of system F that formalizes Reynolds' notion of relational parametricity. In system R, considerably more-terms can be proved equal than in system F : for example, the encoded weak products of F are strong products in R. Also, many \theorems for free" a la Wadler can be proved formally in R. In this paper we describe a semantics for system R. As a rst step, we give a pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 70 شماره
صفحات -
تاریخ انتشار 1999